60 research outputs found
Testing isomorphism of lattices over CM-orders
A CM-order is a reduced order equipped with an involution that mimics complex
conjugation. The Witt-Picard group of such an order is a certain group of ideal
classes that is closely related to the "minus part" of the class group. We
present a deterministic polynomial-time algorithm for the following problem,
which may be viewed as a special case of the principal ideal testing problem:
given a CM-order, decide whether two given elements of its Witt-Picard group
are equal. In order to prevent coefficient blow-up, the algorithm operates with
lattices rather than with ideals. An important ingredient is a technique
introduced by Gentry and Szydlo in a cryptographic context. Our application of
it to lattices over CM-orders hinges upon a novel existence theorem for
auxiliary ideals, which we deduce from a result of Konyagin and Pomerance in
elementary number theory.Comment: To appear in SIAM Journal on Computin
Mathematics and Cryptography: A Marriage of Convenience?
Mathematics and cryptography have a long history together, with the ups and downs inherent in any long relationship. Whether it is a marriage of convenience or a love match, their progeny have lives of their own and have had an impact on the world. This invited lecture will briefly recall some high points from the past, give speculation and encouragement for the future of this marriage, and give counseling on how to improve communication, resolve conflicts, and play well together, based on personal experience and lessons learned
Recommended from our members
Twisting Commutative Algebraic Groups
If is a commutative algebraic group over a field , [View the MathML] source is a commutative ring that acts on , and View the MathML source is a finitely generated free View the MathML source-module with a right action of the absolute Galois group of , then there is a commutative algebraic group [View the MathML source] over , which is a twist of a power of . These group varieties have applications to cryptography (in the cases of abelian varieties and algebraic tori over finite fields) and to the arithmetic of abelian varieties over number fields. For purposes of such applications we devote this article to making explicit this tensor product construction and its basic properties.Mathematic
- …